0.11/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.11/0.12	% Command    : run_E %s %d THM
0.12/0.33	% Computer : n019.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1440
0.12/0.33	% WCLimit    : 180
0.12/0.33	% DateTime   : Thu Jul  4 10:06:24 EDT 2024
0.12/0.33	% CPUTime    : 
0.20/0.47	Running higher-order theorem proving
0.20/0.51	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p
0.92/0.64	# Version: 3.2.0-ho
0.92/0.64	# Preprocessing class: HSLMSMSSLLLCHSA.
0.92/0.64	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.92/0.64	# Starting lpo1_fix with 540s (3) cores
0.92/0.64	# Starting full_lambda_9 with 180s (1) cores
0.92/0.64	# Starting almost_fo_4 with 180s (1) cores
0.92/0.64	# Starting new_ho_9 with 180s (1) cores
0.92/0.64	# Starting pre_casc_4 with 180s (1) cores
0.92/0.64	# Starting ho_unfolding_6 with 180s (1) cores
0.92/0.64	# full_lambda_9 with pid 32613 completed with status 0
0.92/0.64	# Result found by full_lambda_9
0.92/0.64	# Preprocessing class: HSLMSMSSLLLCHSA.
0.92/0.64	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.92/0.64	# Starting lpo1_fix with 540s (3) cores
0.92/0.64	# Starting full_lambda_9 with 180s (1) cores
0.92/0.64	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.92/0.64	# Search class: HGHSM-FSLM32-DHSMMSBN
0.92/0.64	# partial match(1): HGHSM-FSLM32-MHSMMSBN
0.92/0.64	# Scheduled 12 strats onto 1 cores with 180 seconds (180 total)
0.92/0.64	# Starting full_lambda_5 with 15s (1) cores
0.92/0.64	# full_lambda_5 with pid 32618 completed with status 0
0.92/0.64	# Result found by full_lambda_5
0.92/0.64	# Preprocessing class: HSLMSMSSLLLCHSA.
0.92/0.64	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.92/0.64	# Starting lpo1_fix with 540s (3) cores
0.92/0.64	# Starting full_lambda_9 with 180s (1) cores
0.92/0.64	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.92/0.64	# Search class: HGHSM-FSLM32-DHSMMSBN
0.92/0.64	# partial match(1): HGHSM-FSLM32-MHSMMSBN
0.92/0.64	# Scheduled 12 strats onto 1 cores with 180 seconds (180 total)
0.92/0.64	# Starting full_lambda_5 with 15s (1) cores
0.92/0.64	# Preprocessing time       : 0.006 s
0.92/0.64	# Presaturation interreduction done
0.92/0.64	
0.92/0.64	# Proof found!
0.92/0.64	# SZS status Theorem
0.92/0.64	# SZS output start CNFRefutation
0.92/0.64	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
0.92/0.64	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
0.92/0.64	thf(decl_25, type, in: $i > $i > $o).
0.92/0.64	thf(decl_61, type, imp: $o > $o > $o).
0.92/0.64	thf(decl_62, type, d_not: $o > $o).
0.92/0.64	thf(decl_67, type, l_or: $o > $o > $o).
0.92/0.64	thf(decl_72, type, l_some: $i > ($i > $o) > $o).
0.92/0.64	thf(decl_77, type, e_is: $i > $i > $i > $o).
0.92/0.64	thf(decl_123, type, nat: $i).
0.92/0.64	thf(decl_124, type, n_is: $i > $i > $o).
0.92/0.64	thf(decl_127, type, n_some: ($i > $o) > $o).
0.92/0.64	thf(decl_142, type, n_pl: $i > $i > $i).
0.92/0.64	thf(decl_147, type, diffprop: $i > $i > $i > $o).
0.92/0.64	thf(decl_148, type, d_29_ii: $i > $i > $o).
0.92/0.64	thf(decl_149, type, iii: $i > $i > $o).
0.92/0.64	thf(decl_151, type, moreis: $i > $i > $o).
0.92/0.64	thf(decl_152, type, lessis: $i > $i > $o).
0.92/0.64	thf(decl_155, type, esk1_0: $i).
0.92/0.64	thf(decl_156, type, esk2_0: $i).
0.92/0.64	thf(decl_157, type, esk3_0: $i).
0.92/0.64	thf(decl_158, type, esk4_0: $i).
0.92/0.64	thf(def_d_not, axiom, ((d_not)=(^[X36:$o]:((imp @ ((X36)) @ (~($true)))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_d_not)).
0.92/0.64	thf(def_imp, axiom, ((imp)=(^[X34:$o, X35:$o]:(((X34)=>(X35))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_imp)).
0.92/0.64	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_d_29_ii)).
0.92/0.64	thf(def_l_or, axiom, ((l_or)=(^[X42:$o]:(imp @ ((d_not @ ((X42))))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_l_or)).
0.92/0.64	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_e_is)).
0.92/0.64	thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_iii)).
0.92/0.64	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_all_of)).
0.92/0.64	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_is_of)).
0.92/0.64	thf(def_moreis, axiom, ((moreis)=(^[X1:$i, X187:$i]:((l_or @ ((d_29_ii @ X1 @ X187)) @ ((n_is @ X1 @ X187)))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_moreis)).
0.92/0.64	thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_n_some)).
0.92/0.64	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_n_is)).
0.92/0.64	thf(def_lessis, axiom, ((lessis)=(^[X1:$i, X188:$i]:((l_or @ ((iii @ X1 @ X188)) @ ((n_is @ X1 @ X188)))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', def_lessis)).
0.92/0.64	thf(satz22b, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X307:$i]:((in @ X307 @ nat))) @ (^[X308:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((all_of @ (^[X10:$i]:((in @ X10 @ nat))) @ (^[X10:$i]:((((d_29_ii @ (n_pl @ X1 @ X4) @ (n_pl @ X308 @ X10))<=(moreis @ X4 @ X10))<=(d_29_ii @ X1 @ X308)))))))))))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', satz22b)).
0.92/0.64	thf(satz22c, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X290:$i]:((in @ X290 @ nat))) @ (^[X291:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((all_of @ (^[X10:$i]:((in @ X10 @ nat))) @ (^[X10:$i]:(((lessis @ X1 @ X291)=>((iii @ (n_pl @ X1 @ X4) @ (n_pl @ X291 @ X10))<=(iii @ X4 @ X10))))))))))))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', satz22c)).
0.92/0.64	thf(satz19f, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X222:$i]:((in @ X222 @ nat))) @ (^[X223:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((iii @ (n_pl @ X4 @ X1) @ (n_pl @ X4 @ X223))<=(iii @ X1 @ X223))))))))))), file('/export/starexec/sandbox/tmp/tmp.iQTNzJe8bm/E---3.1_32534.p', satz19f)).
0.92/0.64	thf(c_0_15, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(fof_simplification,[status(thm)],[def_d_not])).
0.92/0.64	thf(c_0_16, plain, ((imp)=(^[Z0/* 19 */:$o, Z1:$o]:(((Z0)=>(Z1))))), inference(fof_simplification,[status(thm)],[def_imp])).
0.92/0.64	thf(c_0_17, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
0.92/0.64	thf(c_0_18, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(fof_simplification,[status(thm)],[def_l_or])).
0.92/0.64	thf(c_0_19, plain, ((d_not)=(^[Z0/* 3 */:$o]:(((((Z0))=>(~($true))))))), inference(apply_def,[status(thm)],[c_0_15, c_0_16])).
0.92/0.64	thf(c_0_20, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.92/0.64	thf(c_0_21, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z1 @ Z0))))), inference(fof_simplification,[status(thm)],[def_iii])).
0.92/0.64	thf(c_0_22, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.92/0.64	thf(c_0_23, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.92/0.64	thf(c_0_24, plain, ((moreis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z0 @ Z1))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_moreis])).
0.92/0.64	thf(c_0_25, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z0 @ Z1))))), inference(apply_def,[status(thm)],[c_0_17, def_n_some])).
0.92/0.64	thf(c_0_26, plain, ((l_or)=(^[Z0/* 19 */:$o, Z1:$o]:((((((((Z0)))=>(~($true)))))=>(Z1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18, c_0_16]), c_0_19])).
0.92/0.64	thf(c_0_27, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_20])).
0.92/0.64	thf(c_0_28, plain, ((lessis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z1 @ Z0))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(fof_simplification,[status(thm)],[def_lessis])).
0.92/0.64	thf(c_0_29, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (diffprop @ Z1 @ Z0))))), inference(apply_def,[status(thm)],[c_0_21, def_n_some])).
0.92/0.64	thf(c_0_30, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_22, c_0_23])).
0.92/0.64	thf(c_0_31, plain, ((moreis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z0 @ Z1))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_24, c_0_25]), c_0_26]), c_0_27])).
0.92/0.64	thf(c_0_32, plain, ((lessis)=(^[Z0/* 19 */:$i, Z1:$i]:(((((((((((l_some @ nat @ (diffprop @ Z1 @ Z0))))))=>(~($true)))))=>((((Z0)=(Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_28, c_0_29]), c_0_26]), c_0_27])).
0.92/0.64	thf(c_0_33, plain, ![X513:$i]:(((in @ X513 @ nat)=>![X512:$i]:(((in @ X512 @ nat)=>![X511:$i]:(((in @ X511 @ nat)=>![X510:$i]:(((in @ X510 @ nat)=>((l_some @ nat @ (diffprop @ X513 @ X512))=>((((l_some @ nat @ (diffprop @ X511 @ X510))=>~($true))=>((X511)=(X510)))=>(l_some @ nat @ (diffprop @ (n_pl @ X513 @ X511) @ (n_pl @ X512 @ X510))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz22b]), c_0_25]), c_0_30]), c_0_31])])).
0.92/0.64	thf(c_0_34, negated_conjecture, ~(![X387:$i]:(((in @ X387 @ nat)=>![X386:$i]:(((in @ X386 @ nat)=>![X385:$i]:(((in @ X385 @ nat)=>![X384:$i]:(((in @ X384 @ nat)=>((((l_some @ nat @ (diffprop @ X386 @ X387))=>~($true))=>((X387)=(X386)))=>((l_some @ nat @ (diffprop @ X384 @ X385))=>(l_some @ nat @ (diffprop @ (n_pl @ X386 @ X384) @ (n_pl @ X387 @ X385)))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz22c])]), c_0_32]), c_0_29]), c_0_30])])).
0.92/0.64	thf(c_0_35, plain, ![X701:$i, X702:$i, X703:$i, X704:$i]:(((~(l_some @ nat @ (diffprop @ X703 @ X704))|~($true)|(l_some @ nat @ (diffprop @ (n_pl @ X701 @ X703) @ (n_pl @ X702 @ X704)))|~(l_some @ nat @ (diffprop @ X701 @ X702))|~(in @ X704 @ nat)|~(in @ X703 @ nat)|~(in @ X702 @ nat)|~(in @ X701 @ nat))&(((X703)!=(X704))|(l_some @ nat @ (diffprop @ (n_pl @ X701 @ X703) @ (n_pl @ X702 @ X704)))|~(l_some @ nat @ (diffprop @ X701 @ X702))|~(in @ X704 @ nat)|~(in @ X703 @ nat)|~(in @ X702 @ nat)|~(in @ X701 @ nat)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])])])).
0.92/0.64	thf(c_0_36, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((in @ esk3_0 @ nat)&((in @ esk4_0 @ nat)&((((l_some @ nat @ (diffprop @ esk2_0 @ esk1_0))|((esk1_0)=(esk2_0)))&(($true)|((esk1_0)=(esk2_0))))&((l_some @ nat @ (diffprop @ esk4_0 @ esk3_0))&~(l_some @ nat @ (diffprop @ (n_pl @ esk2_0 @ esk4_0) @ (n_pl @ esk1_0 @ esk3_0))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])])])).
0.92/0.64	thf(c_0_37, plain, ![X1:$i, X4:$i, X6:$i, X5:$i]:(((l_some @ nat @ (diffprop @ (n_pl @ X5 @ X1) @ (n_pl @ X6 @ X4)))|~((l_some @ nat @ (diffprop @ X1 @ X4)))|~(($true))|~((l_some @ nat @ (diffprop @ X5 @ X6)))|~((in @ X4 @ nat))|~((in @ X1 @ nat))|~((in @ X6 @ nat))|~((in @ X5 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_35])).
0.92/0.64	thf(c_0_38, negated_conjecture, ~((l_some @ nat @ (diffprop @ (n_pl @ esk2_0 @ esk4_0) @ (n_pl @ esk1_0 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_36])).
0.92/0.64	thf(c_0_39, plain, ![X1:$i, X6:$i, X5:$i, X4:$i]:(((l_some @ nat @ (diffprop @ (n_pl @ X5 @ X1) @ (n_pl @ X6 @ X4)))|~((in @ X6 @ nat))|~((in @ X5 @ nat))|~((in @ X4 @ nat))|~((in @ X1 @ nat))|~((l_some @ nat @ (diffprop @ X5 @ X6)))|~((l_some @ nat @ (diffprop @ X1 @ X4))))), inference(cn,[status(thm)],[c_0_37])).
0.92/0.64	thf(c_0_40, negated_conjecture, (l_some @ nat @ (diffprop @ esk4_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_36])).
0.92/0.64	thf(c_0_41, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_36])).
0.92/0.64	thf(c_0_42, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_36])).
0.92/0.64	thf(c_0_43, negated_conjecture, (in @ esk3_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_36])).
0.92/0.64	thf(c_0_44, negated_conjecture, (in @ esk4_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_36])).
0.92/0.64	thf(c_0_45, negated_conjecture, ((l_some @ nat @ (diffprop @ esk2_0 @ esk1_0))|((esk1_0)=(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_36])).
0.92/0.64	thf(c_0_46, negated_conjecture, ~((l_some @ nat @ (diffprop @ esk2_0 @ esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_40]), c_0_41]), c_0_42]), c_0_43]), c_0_44])])).
0.92/0.64	thf(c_0_47, plain, ![X410:$i]:(((in @ X410 @ nat)=>![X409:$i]:(((in @ X409 @ nat)=>![X408:$i]:(((in @ X408 @ nat)=>((l_some @ nat @ (diffprop @ X409 @ X410))=>(l_some @ nat @ (diffprop @ (n_pl @ X408 @ X409) @ (n_pl @ X408 @ X410)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz19f]), c_0_29]), c_0_30])])).
0.92/0.64	thf(c_0_48, negated_conjecture, ((esk2_0)=(esk1_0)), inference(sr,[status(thm)],[c_0_45, c_0_46])).
0.92/0.64	thf(c_0_49, plain, ![X603:$i, X604:$i, X605:$i]:((~(in @ X603 @ nat)|(~(in @ X604 @ nat)|(~(in @ X605 @ nat)|(~(l_some @ nat @ (diffprop @ X604 @ X603))|(l_some @ nat @ (diffprop @ (n_pl @ X605 @ X604) @ (n_pl @ X605 @ X603)))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])])])).
0.92/0.64	thf(c_0_50, negated_conjecture, ~((l_some @ nat @ (diffprop @ (n_pl @ esk1_0 @ esk4_0) @ (n_pl @ esk1_0 @ esk3_0)))), inference(spm,[status(thm)],[c_0_38, c_0_48])).
0.92/0.64	thf(c_0_51, plain, ![X5:$i, X4:$i, X1:$i]:(((l_some @ nat @ (diffprop @ (n_pl @ X5 @ X4) @ (n_pl @ X5 @ X1)))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat))|~((l_some @ nat @ (diffprop @ X4 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_49])).
0.92/0.64	thf(c_0_52, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50, c_0_51]), c_0_40]), c_0_41]), c_0_44]), c_0_43])]), ['proof']).
0.92/0.64	# SZS output end CNFRefutation
0.92/0.64	# Parsed axioms                        : 393
0.92/0.64	# Removed by relevancy pruning/SinE    : 263
0.92/0.64	# Initial clauses                      : 344
0.92/0.64	# Removed in clause preprocessing      : 175
0.92/0.64	# Initial clauses in saturation        : 169
0.92/0.64	# Processed clauses                    : 357
0.92/0.64	# ...of these trivial                  : 5
0.92/0.64	# ...subsumed                          : 85
0.92/0.64	# ...remaining for further processing  : 267
0.92/0.64	# Other redundant clauses eliminated   : 22
0.92/0.64	# Clauses deleted for lack of memory   : 0
0.92/0.64	# Backward-subsumed                    : 0
0.92/0.64	# Backward-rewritten                   : 2
0.92/0.64	# Generated clauses                    : 727
0.92/0.64	# ...of the previous two non-redundant : 698
0.92/0.64	# ...aggressively subsumed             : 0
0.92/0.64	# Contextual simplify-reflections      : 1
0.92/0.64	# Paramodulations                      : 536
0.92/0.64	# Factorizations                       : 2
0.92/0.64	# NegExts                              : 2
0.92/0.64	# Equation resolutions                 : 28
0.92/0.64	# Disequality decompositions           : 0
0.92/0.64	# Total rewrite steps                  : 113
0.92/0.64	# ...of those cached                   : 96
0.92/0.64	# Propositional unsat checks           : 0
0.92/0.64	#    Propositional check models        : 0
0.92/0.64	#    Propositional check unsatisfiable : 0
0.92/0.64	#    Propositional clauses             : 0
0.92/0.64	#    Propositional clauses after purity: 0
0.92/0.64	#    Propositional unsat core size     : 0
0.92/0.64	#    Propositional preprocessing time  : 0.000
0.92/0.64	#    Propositional encoding time       : 0.000
0.92/0.64	#    Propositional solver time         : 0.000
0.92/0.64	#    Success case prop preproc time    : 0.000
0.92/0.64	#    Success case prop encoding time   : 0.000
0.92/0.64	#    Success case prop solver time     : 0.000
0.92/0.64	# Current number of processed clauses  : 139
0.92/0.64	#    Positive orientable unit clauses  : 20
0.92/0.64	#    Positive unorientable unit clauses: 0
0.92/0.64	#    Negative unit clauses             : 11
0.92/0.64	#    Non-unit-clauses                  : 108
0.92/0.64	# Current number of unprocessed clauses: 621
0.92/0.64	# ...number of literals in the above   : 3247
0.92/0.64	# Current number of archived formulas  : 0
0.92/0.64	# Current number of archived clauses   : 114
0.92/0.64	# Clause-clause subsumption calls (NU) : 4637
0.92/0.64	# Rec. Clause-clause subsumption calls : 1011
0.92/0.64	# Non-unit clause-clause subsumptions  : 80
0.92/0.64	# Unit Clause-clause subsumption calls : 96
0.92/0.64	# Rewrite failures with RHS unbound    : 0
0.92/0.64	# BW rewrite match attempts            : 5
0.92/0.64	# BW rewrite match successes           : 1
0.92/0.64	# Condensation attempts                : 0
0.92/0.64	# Condensation successes               : 0
0.92/0.64	# Termbank termtop insertions          : 65228
0.92/0.64	# Search garbage collected termcells   : 17366
0.92/0.64	
0.92/0.64	# -------------------------------------------------
0.92/0.64	# User time                : 0.076 s
0.92/0.64	# System time              : 0.017 s
0.92/0.64	# Total time               : 0.093 s
0.92/0.64	# Maximum resident set size: 4972 pages
0.92/0.64	
0.92/0.64	# -------------------------------------------------
0.92/0.64	# User time                : 0.087 s
0.92/0.64	# System time              : 0.020 s
0.92/0.64	# Total time               : 0.106 s
0.92/0.64	# Maximum resident set size: 2364 pages
0.92/0.64	% E---3.1 exiting
0.92/0.64	% E exiting
0.92/0.64	EOF